Bandwidth Utilization in Sorted-Priority Schedulers
نویسنده
چکیده
This paper first introduces bandwidth utilization metric and then analyzes sorted-priority schedulers in the terms of the metric. The results show that the utilization is directly proportional to both the number of delay bound classes and the dependency of delay bound on rate but inversely proportional to packet size.
منابع مشابه
Draft as Accepted to Sigmetrics Please Do Not Distribute -symbiotic Jobscheduling with Priorities for a Simultaneous Multithreading Processor
Simultaneous Multithreading machines beneet from jobscheduling software that monitors how well coscheduled jobs share CPU resources, and coschedules jobs that interact well to make more eecient use of those resources. As a result, informed coscheduling can yield signiicant performance gains over naive schedulers. However, prior work has only focused only the situation where jobs have equal prio...
متن کاملCharacterization of Bandwidth-aware Meta-schedulers for Co-allocating Jobs in a Mini-grid∗
In this paper, we present a bandwidth-centric job communication model that captures the interaction and impact of simultaneously co-allocated jobs in a grid. We compare our dynamic model with previous research that utilizes a fixed execution time penalty for co-allocated jobs. We explore the interaction of simultaneously co-allocated jobs and the contention they often create in the network infr...
متن کاملDouble-sorted Scheduling in Process Cruise Control Environments
Schedulers found in contemporary operating systems try to maximise the throughput and the responsiveness perceived by the user. In this thesis a scheduler policy is introduced which not only tries to fulfil those objectives but also takes the order of task execution into consideration. By keeping strict priority scheduling or by loosening priority restrictions this policy enables the system dev...
متن کاملBSFQ: Bin Sort Fair Queueing
Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellent approximation for Weighted Fair Queueing (WFQ) while framebased methods are more computationally efficient. We present a new packet scheduling algorithm called Bin Sort Fair Queueing (BSFQ) that combines the strengths ...
متن کاملRate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlled Static-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies t...
متن کامل